Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators

Some Random Fixed Point Theorems for Condensing and Nonexpansive Operators

Some random versions of deterministic fixed point theorems for condensing and nonexpansive operators are obtained.

Common fixed point theorem for nonexpansive type single valued mappings

The aim of this paper is to prove a common fixed point theorem for nonexpansive type single valued mappings which include both continuous and discontinuous mappings by relaxing the condition of continuity by weak reciprocally continuous mapping. Our result is generalize and extends the corresponding result of Jhade et al. [P.K. Jhade, A.S. Saluja and R. Kushwah, Coincidence and fixed points of ...

A policy iteration algorithm for fixed point problems with nonexpansive operators

The aim of this paper is to solve the fixed point problems : v = Ov, with Ov(x) def = max(Lv(x), Bv(x)), x ∈ E , (1) where E is a finite set, L is contractive and B is a nonexpansive operator and v = Ov, with Ov(x) def = max(sup w Lv(x), sup z Bv(x)), x ∈ E , (2) where W and Z are general control sets, the operators L are contractive and operators B are nonexpansive. For these two problems, we ...

Distributed Asynchronous Computation of Fixed Points* 2. a Model for Distributed Asynchronous Fixed Point Algorithms

We present an algorithmic model for distribnted computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumptions on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We provide a general convergence...

Strong Convergence Theorems for the Split Common Fixed Point Problem for Countable Family of Nonexpansive Operators